Parallel Occlusion Culling for Interactive Walkthroughs using Multiple GPUs

نویسندگان

  • Naga K. Govindaraju
  • Avneesh Sud
  • Sung-Eui Yoon
  • Dinesh Manocha
چکیده

We present a new parallel occlusion culling algorithm for interactive display of large environments. It uses a cluster of three graphics processing units (GPUs) to compute an occlusion representation, cull away occluded objects and render the visible primitives. Moreover, our parallel architecture reverses the role of two of the GPUs between successive frames to lower the communication overhead. We have combined the occlusion culling algorithm with pre-computed levels-of-detail and use it for interactive display of geometric datasets. The resulting system has been implemented and applied to large environments composed of tens of millions of primitives. In practice, it is able to render such models at interactive rates with little loss in image fidelity. The performance of the overall occlusion culling algorithm is based on the graphics hardware computational power growth curve which has recently outperformed the Moore’s Law for general CPU power growth.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quick-VDR: Interactive View-Dependent Rendering of Massive Models in Commodity GPUs

• The Challenge We present a novel approach for interactive viewdependent rendering of massive models on commodity GPUs. Our algorithm combines viewdependent simplifi cation, occlusion culling, and out-of-core rendering. In general, view-dependent simplifi cation is not well suited for current graphics hardware because it requires high bandwidth between the CPU and GPU and works well only if al...

متن کامل

GigaWalk: Interactive Walkthrough of Complex Environments

We present a new parallel algorithm for interactive walkthrough of complex, gigabyte-sized environments. Our approach combines occlusion culling and levelsof-detail and uses two graphics pipelines with one or more processors. We use a unified scene graph representation for multiple acceleration techniques, and we present novel algorithms for clustering geometry spatially, computing a scene grap...

متن کامل

E ective Occlusion Culling for the Interactive Display of Arbitrary Models

HANSONG ZHANG: E ective Occlusion Culling for the Interactive Display of Arbitrary Models. (Under the direction of Dinesh Manocha.) As an advanced form of visibility culling, occlusion culling detects hidden objects and prevents them from being rendered. An occlusion-culling algorithm that can e ectively accelerate interactive graphics must simultaneously satisfy the following criteria: General...

متن کامل

Analysis of coherence strategies for stereo occlusion culling

This paper explores the benefits that can be achieved for stereoscopic visualization when using occlusion culling strategies. Graphics processing units (GPUs) are improving their computational power and functionalities. On the other hand, models are also increasing their size and users require more demanding image quality. Occlusion culling provides significant frame rate speed-ups in densely o...

متن کامل

Occluder Shadows for Fast Walkthroughs of Urban Environments

This paper describes a new algorithm that employs image-based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and automatically combine a relatively large set of occluders. The algorithm is fast to calculate and therefore also useful for scenes of moderate complexity and walkthroughs with over 20 frames per second. Occlusion is calcula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002